Efficient Vertex-Label Distance Oracles for Planar Graphs
نویسندگان
چکیده
منابع مشابه
Distance Oracles for Vertex-Labeled Graphs
Given a graph G = (V,E) with non-negative edge lengths whose vertices are assigned a label from L = {λ1, . . . , λl}, we construct a compact distance oracle that answers queries of the form: “What is δ(v, λ)?”, where v ∈ V is a vertex in the graph, λ ∈ L a vertex label, and δ(v, λ) is the distance (length of a shortest path) between v and the closest vertex labeled λ in G. We formalize this nat...
متن کاملExact distance oracles for planar graphs
We present new and improved data structures that answer exact node-to-node distance queries in planar graphs. Such data structures are also known as distance oracles. For any directed planar graph on n nodes with non-negative lengths we obtain the following: • Given a desired space allocation S ∈ [n lg lgn, n], we show how to construct in Õ(S) time a data structure of size O(S) that answers dis...
متن کاملImproved Distance Oracles and Spanners for Vertex-Labeled Graphs
Consider an undirected weighted graph G = (V,E) with |V | = n and |E| = m, where each vertex v ∈ V is assigned a label from a set of labels L = {λ1, ..., λl}. We show how to construct a compact distance oracle that can answer queries of the form: “what is the distance from v to the closest λ-labeled node” for a given node v ∈ V and label λ ∈ L. This problem was introduced by Hermelin, Levy, Wei...
متن کاملBetter Tradeoffs for Exact Distance Oracles in Planar Graphs
We present an O(n)-space distance oracle for directed planar graphs that answers distance queries in O(logn) time. Our oracle both significantly simplifies and significantly improves the recent oracle of Cohen-Addad, Dahlgaard and Wulff-Nilsen [FOCS 2017], which uses O(n)-space and answers queries in O(logn) time. We achieve this by designing an elegant and efficient point location data structu...
متن کاملConnectivity Oracles for Planar Graphs
We consider dynamic subgraph connectivity problems for planar undirected graphs. In this model there is a fixed underlying planar graph, where each edge and vertex is either “off” (failed) or “on” (recovered). We wish to answer connectivity queries with respect to the “on” subgraph. The model has two natural variants, one in which there are d edge/vertex failures that precede all connectivity q...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2017
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-017-9827-0